Doubly stochastic matrices whose powers eventually stop

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Matrices whose powers approximate the identity

In this paper we characterize the matrices A with the following property: for each ε > 0 there exists k ∈ N such that ‖Ak − I‖ < ε for a given matrix norm. This characterization is applied to the theory of unitary, hermitian nonnegative, positive and stochastic matrices.

متن کامل

Doubly stochastic matrices of trees

In this paper, we obtain sharp upper and lower bounds for the smallest entries of doubly stochastic matrices of trees and characterize all extreme graphs which attain the bounds. We also present a counterexample to Merris’ conjecture on relations between the smallest entry of the doubly stochastic matrix and the algebraic connectivity of a graph in [R. Merris, Doubly stochastic graph matrices I...

متن کامل

Random doubly stochastic tridiagonal matrices

Let Tn be the compact convex set of tridiagonal doubly stochastic matrices. These arise naturally in probability problems as birth and death chains with a uniform stationary distribution. We study ‘typical’ matrices T ∈ Tn chosen uniformly at random in the set Tn. A simple algorithm is presented to allow direct sampling from the uniform distribution on Tn. Using this algorithm, the elements abo...

متن کامل

Noncirculant Toeplitz Matrices All of Whose Powers Are Toeplitz

Let a, b and c be fixed complex numbers. Let Mn(a, b, c) be the n×n Toeplitz matrix all of whose entries above the diagonal are a, all of whose entries below the diagonal are b, and all of whose entries on the diagonal are c. For 1 6 k 6 n, each k × k principal minor of Mn(a, b, c) has the same value. We find explicit and recursive formulae for the principal minors and the characteristic polyno...

متن کامل

The polytope of even doubly stochastic matrices

The polytope Q, of the convex combinations of the permutation matrices of order n is well known (Birkhoff’s theorem) to be the polytope of doubly stochastic matrices of order n. In particular it is easy to decide whether a matrix of order n belongs to Q,. . check to see that the entries are nonnegative and that all row and columns sums equal 1. Now the permutations z of { 1, 2, . . . . n} are i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2001

ISSN: 0024-3795

DOI: 10.1016/s0024-3795(01)00260-9